Nonadiabatic quantum search algorithms
نویسندگان
چکیده
منابع مشابه
Nonadiabatic quantum search algorithms
We present two continuous-time quantum search algorithms similar to the adiabatic search algorithm, but now without the requirement of adiabatic evolution. Both algorithms can find the marked state in a time proportional to N. The behavior of the first algorithm is, essentially, similar to Grover’s algorithm, but the second model possesses the important property that one does not need to single...
متن کاملNonadiabatic Quantum Brownian Rectifiers
We study both dissipative and nondissipative quantum transport in discrete Brownian rectifiers being driven by nonthermal noise that is unbiased on average. In the absence of dissipation the current is always zero and the ballistic diffusion changes into normal diffusion. The dissipative quantum dynamics exhibits current (with distinctive reversals) as a result of the cooperative interplay betw...
متن کاملQuantum Factoring and Search Algorithms
Quantum Factoring and Search Algorithms Quantum Information Seminar Friday, Sep. 17, 1999 Ashok Muthukrishnan Rochester Center for Quantum Information (RCQI) ___________________________________________________________ § 1. Quantum Algorithm for Factorisation (1994) A. Factorising and cryptography p. 2 B. Relation of factorisation to period-finding p. 5 C. Quantum algorithm for period-finding p....
متن کاملQuantum games via search algorithms
We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the two possible states. These games are characterized by a continuous space of strategies and the selection of a particular strategy is determined by the momen...
متن کاملQuantum Walk Based Search Algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2007
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.76.052318